https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:20800 Wed 27 Jul 2022 13:49:56 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:19331 Sat 24 Mar 2018 07:52:14 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:28824 G = (V, E) be a graph without isolated vertices. Let m*(G) denote the optimal pixel expansion of a visual cryptography scheme for the strong access structure Γ(G) on V whose basis is E. In this paper we determine m*(G) for any connected graph G with vertex covering number two.]]> Sat 24 Mar 2018 07:38:27 AEDT ]]>